A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata
نویسندگان
چکیده
We prove a time-space tradeoff for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Rackoff’s “jumping automata for graphs.”
منابع مشابه
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
We investigate time-space tradeoffs for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Rackoff's ``Jumping Automata for Graphs.'' Our strongest tradeoff is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depth-first search is optimal. Since ...
متن کاملA Time-Space Tradeo for Undirected Graph Traversal by Walking Automata
We prove a time-space tradeo for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Racko 's \Jumping Automata for Graphs". This material is based upon work supported in part by the Natural Sciences and Engineering Research Council of Canada, by the National Science Foundation under Grants CCR-8703196, CCR-8858799, CCR-8907960, and CCR9002891, and by...
متن کاملTime-Space Tradeoffs for Undirected Graph Traversal
We prove time-space tradeoffs for traversing undirected graphs. One of these is a quadratic lower bound on a deterministic model that closely matches the recent probabilistic upper bound of Broder, Karlin, Raghavan, and Upfal. The models used are variants of Cook and Rackoff’s “Jumping Automata for Graphs”. 1 The Complexity of Graph Traversal Graph traversal is a fundamental problem in computin...
متن کاملTime-Space Tradeo s for Undirected Graph Traversal by Graph Automata
We investigate time-space tradeo s for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Racko 's \Jumping Automata for Graphs". Our strongest tradeo is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depthrst search is optimal. Since our bound...
متن کاملTime - Space Tradeo s for Undirected Graph Traversal
We prove time-space tradeo s for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Racko 's \Jumping Automata for Graphs". Our strongest tradeo is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depthrst search is optimal. Since our bound in fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 28 شماره
صفحات -
تاریخ انتشار 1999